On Topology Preservation for Triangular Thinning Algorithms
نویسندگان
چکیده
Thinning is a frequently used strategy to produce skeletonlike shape features of binary objects. One of the main problems of parallel thinning is to ensure topology preservation. Solutions to this problem have been already given for the case of orthogonal and hexagonal grids. This work introduces some characterizations of simple pixels and some sufficient conditions for parallel thinning algorithms working on triangular grids (or hexagonal lattices) to preserve topology.
منابع مشابه
On Topology Preservation for Hexagonal Parallel Thinning Algorithms
Topology preservation is the key concept in parallel thinning algorithms on any sampling schemes. This paper establishes some sufficient conditions for parallel thinning algorithms working on hexagonal grids (or triangular lattices) to preserve topology. By these results, various thinning (and shrinking to a residue) algorithms can be verified. To illustrate the usefulness of our sufficient con...
متن کاملHexagonal parallel thinning algorithms based on sufficient conditions for topology preservation
Thinning is a well-known technique for producing skeleton-like shape features from digital binary objects in a topology preserving way. Most of the existing thinning algorithms presuppose that the input images are sampled on orthogonal grids. This paper presents new sufficient conditions for topology preserving reductions working on hexagonal grids (or triangular lattices) and eight new 2D hexa...
متن کاملThinning algorithms based on sufficient conditions for topology preservation
Description: Thinning is a widely used pre–processing step in digital image processing and pattern recognition. It is an iterative layer by layer erosion until only the "skeletons" of the objects are left. Thinning algorithms are generally constructed in the following way: first the thinning strategy and the deletion rules are figured out, then the topological correctness is proved. In the case...
متن کاملFully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation
This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26, 6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is a...
متن کاملTopology Preserving 2-subfield 3d Thinning Algorithms
This paper presents a new family of 3D thinning algorithms for extracting skeleton–like shape features (i.e, centerline, medial surface, and topological kernel) from volumetric images. A 2-subfield strategy is applied: all points in a 3D picture are partitioned into two subsets which are alternatively activated. At each iteration, a parallel operator is applied for deleting some border points i...
متن کامل